Note on sparse signal recovery
نویسنده
چکیده
Definition 1 (Restricted isometry and orthogonality). The S-restricted isometry constant δS of a matrix F ∈ Rn×m is the smallest quantity such that (1− δS)‖x‖2 ≤ ‖FTx‖2 ≤ (1 + δS)‖x‖2 for all T ⊆ [m] with |T | ≤ S and all x ∈ R|T |. The (S, S′)-restricted orthogonality constant θS,S′ of F is the smallest quantity such that |FTx · FT ′x′| ≤ θS,S′‖c‖‖c‖ for all disjoint T, T ′ ⊆ [m] with |T | ≤ S and |T ′| ≤ S′, and all x ∈ R|T | and x ∈ R|T ′|. Definition 2 (Exact Reconstruction Principle). The matrix F ∈ Rn×m obeys the (deterministic) S-Exact Reconstruction Principle (S-ERP) if, for any h ∈ R with support on some J with |J | ≤ S, there exists w ∈ R satisfying w · vi = sgn(hi) ∀i ∈ J |w · vi| < 1 ∀i 6∈ J. Lemma 1. For all S, S′, we have θS,S′ ≤ δS+S′ ≤ θS,S′ +max(δS , δS′).
منابع مشابه
Note on sparsity in signal recovery and in matrix identification
The standard approach to recover a signal with a sparse representation in D is to design a measurement matrix ΦD ∈ Cm×n which allows the recovery of any f ∈ Σk from the measurement vector ΦDf whenever k is sufficiently small. While a minimal requirement for the recovery of any f ∈ Σk is that the constructed map ΦD : Σ D k −→ C, f 7→ ΦDf is injective, the recent literature on sparse signal recov...
متن کاملNonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as l1-minimization find the sparsest solution to certain systems of equations. Random matrices have become a popular choice for the measurement matrix. Indeed, near-optimal uniform recovery results have been shown for such matrices. In this note we f...
متن کاملNonuniform Sparse Recovery with Subgaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information using efficient recovery methods such as `1-minimization. Random matrices have become a popular choice for the measurement matrix. Indeed, near-optimal uniform recovery results have been shown for such matrices. In this note we focus on nonuniform recovery using subgaussian random m...
متن کاملA Short Note on Compressed Sensing with Partially Known Signal Support Technical Report: TR-LJ-2009.01
In this short note, we propose another demonstration of the recovery of sparse signals in Compressed Sensing when their support is partially known. In particular, without very surprising conclusion, this paper extends the results presented recently in [VL09] to the cases of compressible signals and noisy measurements by slightly adapting the proof developed in [Can08].
متن کاملOn the optimality of a L1/L1 solver for sparse signal recovery from sparsely corrupted compressive measurements
On the optimality of a ℓ 1 /ℓ 1 solver for sparse signal recovery from sparsely corrupted compressive measurements. Abstract This short note proves the ℓ 2 − ℓ 1 instance optimality of a ℓ 1 /ℓ 1 solver, i.e., a variant of basis pursuit denoising with a ℓ 1 fidelity constraint, when applied to the estimation of sparse (or compressible) signals observed by sparsely corrupted compressive measurem...
متن کاملOne-Bit Quantization Design and Adaptive Methods for Compressed Sensing
There have been a number of studies on sparse signal recovery from one-bit quantized measurements. Nevertheless, little attention has been paid to the choice of the quantization thresholds and its impact on the signal recovery performance. This paper examines the problem of one-bit quantizer design for sparse signal recovery. Our analysis shows that the magnitude ambiguity that ever plagues con...
متن کامل